Enumerating all bilocal Clifford distillation protocols through symmetry reduction

نویسندگان

چکیده

Entanglement distillation is an essential building block in quantum communication protocols. Here, we study the class of near-term implementable protocols that use bilocal Clifford operations followed by a single round communication. We introduce tools to enumerate and optimise over all for up $n=5$ (not necessarily equal) Bell-diagonal states using commodity desktop computer. Furthermore, exploiting symmetries input states, find $n=8$ copies Werner state. For latter case, present circuits achieve highest fidelity with perfect no decoherence. These have modest depth number two-qubit gates. Our results are based on correspondence between double cosets symplectic group, improve previously known

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating All Maximal Frequent Subtrees

Given a collection of leaf-labeled trees on a common leafset and a fraction f in (1/2,1], a frequent subtree (FST) is a subtree isomorphically included in at least fraction f of the input trees. The well-known maximum agreement subtree (MAST) problem identifies FST with f = 1 and having the largest number of leaves. Apart from its intrinsic interest from the algorithmic perspective, MAST has pr...

متن کامل

Model Checking Population Protocols in PAT with Symmetry Reduction

The population protocol model has emerged as an elegant computation paradigm for describing mobile ad hoc networks, consisting of a number of mobile nodes that interact with each other to carry out a computation. The interactions of nodes are subject to a global fairness constraint, which plays a vital role in designing self-stabilizing population protocols. In this chapter, we focus on automat...

متن کامل

Enumerating all maximal biclusters in numerical datasets

Biclustering has proved to be a powerful data analysis technique due to its wide success in various application domains. However, the existing literature presents efficient solutions only for enumerating maximal biclusters with constant values, or heuristic-based approaches which can not find all biclusters or even support the maximality of the obtained biclusters. Here, we present a general fa...

متن کامل

Enumerating All Solutions for Constraint Satisfaction Problems

We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and Hébrard [CH97] and generalized by Cohen [Coh04], reduces the enumeration problem for a constraint language Γ to the decision problem for a slightly enlarged constraint language Γ, i.e., it yields an efficient enumeration...

متن کامل

Bilocal *-automorphisms of B(h)

In this note we show that the bilocal *-automorphisms of the C∗-algebra B(H) of all bounded linear operators acting on a complex infinite dimensional separable Hilbert space H are precisely the unital algebra *-endomorphisms of B(H). The study of local derivations of operator algebras has been initiated by Kadison [5] and Larson and Sourour [8]. A linear map ∆ on an algebra is called a local de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum

سال: 2022

ISSN: ['2521-327X']

DOI: https://doi.org/10.22331/q-2022-05-19-715